Chaotic Cryptosystems: Cryptanalysis and Identifiability

Application of Gray code to the cryptanalysis of chaotic cryptosystems

Gray codes have found many applications in engineering and mathematics. In this work we explain how to apply Gray codes to the determination of the control parameter and initial point of a chaotic orbit generated by the Mandelbrot map when the kneading sequence is known. Possible applications to the cryptanalysis of a certain type of cryptosystems based on Baptista’s algorithm are also discussed.

Cryptanalysis of Dynamic Look-up Table Based Chaotic Cryptosystems

In recent years many chaotic cryptosystems based on Baptista’s seminal work have been proposed. We analyze the security of two of the newest and most interesting ones, which use a dynamically updated look-up table and also work as stream ciphers. We provide different attack techniques to recover the keystream used by the algorithms. The knowledge of this keystream provides the attacker with the...

Cryptanalysis of Hybrid Cryptosystems

Cryptanalysis of the Square Cryptosystems

Following the cryptanalyses of the encryption scheme HFE and of the signature scheme SFLASH, no serious alternative multivariate cryptosystems remained, except maybe the signature schemes UOV and HFE−−. Recently, two proposals have been made to build highly efficient multivariate cryptosystems around a quadratic internal transformation: the first one is a signature scheme called square-vinegar ...

Cryptanalysis of RSA-type cryptosystems: A visit

This paper surveys RSA-type implementations based on Lucas sequences and on elliptic curves. The main focus is the way how some known attacks on RSA were extended to LUC, KMOV and Demytko’s system. It also gives some directions for the choice of the most appropriate RSA-type system for a given application.